An Algorithm to Find Minimal Sound and Complete Partitions for Model Checking
نویسنده
چکیده
ION1: For each variable, put all variable values that do not appear in the property in the same equivalence class. Formally, 8i; 1 i n, let D i ( ) = fd i;1 ; :::; d i;k g, 1 k m. Then create a class ^ d i;l 2 PART (D i ), 1 l < m, for which h i (d i;1 ) = h i (d i;2 ) = ... = h i (d i;k ) = ^ d i;l . Using our abbreviation, 8i; 1 i n, A(D i ( )) 2 PART (D i ). Lemma p1: For each variable v i , Abstraction1 creates a partition over D i ( ). (proof is obvious) Theorem1: Abstraction1 is sound.
منابع مشابه
Reachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملGeneralized Strong Preservation by Abstract Interpretation
Many algorithms have been proposed for reducing the state space of a Kripke structure in order to obtain a minimal abstract structure that strongly preserves a given temporal specification language. These are partition refinement algorithms, namely they work on standard abstract models which are partitions of the state space States . In an abstract interpretation-based view, we show that state ...
متن کاملOptimal Trajectory Generation for a Robotic Worm via Parameterization by B-Spline Curves
In this paper we intend to generate some set of optimal trajectories according to the number of control points has been applied for parameterizing those using B-spline curves. The trajectories are used to generate an optimal locomotion gait in a crawling worm-like robot. Due to gait design considerations it is desired to minimize the required torques in a cycle of gait. Similar to caterpillars,...
متن کاملAn improved opposition-based Crow Search Algorithm for Data Clustering
Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...
متن کاملAn Algorithm for Multi-Realization of Nonlinear MIMO Systems
This paper presents a theoretical approach to implementation of the “Multi-realization of nonlinear MIMO systems”. This method aims to find state-variable realization for a set of systems, sharing as many parameters as possible. In this paper a special nonlinear multi-realization problem, namely the multi-realization of feedback linearizable nonlinear systems is considered and an algorithm for ...
متن کامل